The Mathematical Foundations of Bond Graphs-IV. Matrix Representations and Causality
نویسندگان
چکیده
The development of a mathematical theory for bond graphs continues with an analysis qf two areas crucial to the derivation of system equations,from a bond graph model. Matri.y representations of bond graph matroids ure exumined and used to provide a rigorous proof of the mathematical equivalence sf‘ the linear graph and bond graph modelling methods. The procedure of selecting causality by the method of’ cuusal strokes is discussed. This is shown to he a device,for choosing a base of the cycle matroid of a bond gruph, und u s@cient condition is proved for when the method gives u base. An example is given of’s bond graph with u cuusul loop which corresponds to a vulid causal assi,gnment. Various combinatorial ,finmulue are proved concerning ranks und dimensions. Formulae ,for the ranks of’@rt and flow matrices and the number of independent equutions obtained ,from u bond graph are consequences of’ the results.
منابع مشابه
The Mathematical Foundations of Bondgraphs VI Causality and Regularity for Directed Bondgraphs
This article concludes a series on the mathematical foundations of bondgraphs an abstraction of the concept of bondgraph junction structure without TF or GY com ponents used in physical system modelling Di bondgraphs which are bondgraphs for which a direction indicated by a half arrow has been assigned on each bond are pic torial representations of a dual pair of integral matroids called the cy...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملThe Mathematical Foundations of Bond Graphs-I. Algebraic Theory
Elementary mathematical concepts from linear algebra are used to develop an independent theory for non-directed bond graphs. The dejinition of a bond graph is given and its structure as a combinatorial object is studied. This is accomplished by constructing a vector space, called the bond space of the bond graph. Topological information is encoded in the bond graph by dejining a subspace of the...
متن کاملThe Mathematical Foundations of Bond Graphs-III. Matroid Theory
The cycle and co-cycle matroids of a bond graph are defined using chain group matroids derived,from the cycle and co-cycle vector spaces qf a bond graph. The relationship between these structures is investigated and various results are proved. A precise equivalence is dejined for bond graphs. Duality theory is seen to be very clear in the context of bond graph matroids.
متن کاملThe Mathematical Foundations of Bond Graphs-II. Duality
A discussion of duality continues the development of a mathematical theory for bond graphs as combinatorial structures. The dual of a bondgraph is de$ned and its associated vector spaces are the co-spaces of the original bond graph. The relationship between the algebraic structures and their duals is explored. The theory is used to justfy the construction of a simplified bond graph, the proper ...
متن کامل